4 Hierarchical Learning of Boolean Functions

نویسنده

  • Shuzo Takahashi
چکیده

The learning of Boolean functions has been the focus of a number of papers in computer science in the last few years, many of which have been stimulated by the work of Valiant [3, 41. We also mention especially the recent long article by Blumer et al. [l] on learnability for various classes of concepts including especially Boolean classes. The thrust of most of this theoretical work has essentially been to show under what conditions concepts can be learned in polynomial time or space. It is of course important to show that learning is feasible for as wide a class of concepts as possible. However, it is also important to focus on detailed results of a very finitistic kind, which are characteristic of learning theory as applied to human behavior, and are of intrinsic interest also in machine learning. In this paper we consider conditions under which a hierarchy of Boolean functions can increase in significant ways the rate of learning of a given Boolean function of n variables. In this context we also compare serial and parallel hierarchical learning, with, as might be expected, the most dramatic effects being produced by parallel hierarchical learning. Because in general the results are better for parallel than for serial learning the reader might wonder why we include a systematic study of serial learning. The reason is that even under serial learning conditions hierarchical learning can often lead to dramatic improvement in the rate of learning. There is some literature on hierarchical learning, but the results are not closely related to ours. We refer the reader to Rivest and Sloan [2], and the references given there. There are three distinct psychological processes involved in our theoretical approach to hierarchical learning. They are (i) stimulus sampling, often given in the form of a pattern; (ii) concept sampling; and (iii) function formation-meaning forming some function of the concepts sampled. In some contexts it may be usefu1 to refer to function formation as hypothesis sampling. In any case, process (i) brings in information from the world outside, but (ii) and (iii) are essentially internal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES

Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...

متن کامل

Learning Boolean Functions

2 Probabilistic modelling of learning 4 2.1 A probabilistic model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 A learnability result for Boolean classes . . . . . . . . . . . . . . . . . . . . 6 2.4 Learning monomials . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.5 Di...

متن کامل

A Hierarchical Approach to Learning the Boolean Multiplexer Function

This paper describes the recently developed genetic programming paradigm which genetically breeds populations of computer programs to solve problems. In genetic programming, the individuals in the population are hierarchical compositions of functions and arguments. Each of these individual computer programs is evaluated for its fitness in handling the problem environment. The size and shape of ...

متن کامل

Learning Real and Boolean Functions: When Is Deep Better Than Shallow

We describe computational tasks – especially in vision – that correspond to compositional/hierarchical functions. While the universal approximation property holds both for hierarchical and shallow networks, we prove that deep (hierarchical) networks can approximate the class of compositional functions with the same accuracy as shallow networks but with exponentially lower VC-dimension as well a...

متن کامل

Learning Boolean Functions Incrementally

Classical learning algorithms for Boolean functions assume that unknown targets are Boolean functions over fixed variables. The assumption precludes scenarios where indefinitely many variables are needed. It also induces unnecessary queries when many variables are redundant. Based on a classical learning algorithm for Boolean functions, we develop two learning algorithms to infer Boolean functi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003